The volume of relaxed Boolean-quadric and cut polytopes
نویسندگان
چکیده
منابع مشابه
The volume of relaxed Boolean-quadric and cut polytopes
For n 2, the boolean quadric polytope P n is the convex hull in d := ? n+1 2 dimensions of the binary solutions of x i x j = y ij , for all i < j in N := f1; 2; :::; ng. The polytope is naturally modeled by a somewhat larger polytope; namely, Q n the solution set of y ij x i , y ij x j , x i + x j 1 + y ij , y ij 0, for all i; j in N. In a rst step toward seeing how well Q n approximates P n , ...
متن کاملBoolean quadric polytopes are faces of linear ordering polytopes
Let PBQP(n) be a boolean quadric polytope, n ∈ N, PLO(m) — linear ordering polytope, m ∈ N. It is shown that PBQP(n) is linearly isomorphic to a face of PLO(2n). 1 Введение Булевы квадратичные многогранники PBQP(n), n ∈ N, возникают, в первую очередь, в контексте поиска эффективных решений для задачи квадратичного 0/1программирования, где n — число 0/1-переменных. Изучению их свойств, а также с...
متن کاملA new separation algorithm for the Boolean quadric and cut polytopes
A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero-one quadratic programming and the maxcut problem, respectively. We present a new algorithm, which separates over a class of valid inequalities that includes all odd bic...
متن کاملSome properties of the Boolean Quadric Polytope
The topic of our research is unconstrained 0-1 quadratic programming. We find some properties of the Boolean Quadric Polytope, which is obtained from the standard linearization of the given 0-1 quadratic function. By using a result obtained by Deza and Laurent on a class of hypermetric inequalities for the Cut Polytope, we find a necessary and sufficient condition for a class of inequalities to...
متن کاملThe even and odd cut polytopes
Deza, M. and M. Laurent, The even and odd cut polytopes, Discrete Mathematics 119 (1993) 49966. The cut polytope P, is the convex hull of the incidence vectors of all cuts of the complete graph K, on n nodes. An even cut is a cut of even cardinality. For n odd, all cuts are even. For n even, we consider the even cut polytope EvP,, defined as the convex hull of the incidence vectors of all even ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00343-u